Faster Algorithms to Enumerate Hypergraph Transversals
نویسندگان
چکیده
A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversals of a hypergraph. For each fixed k ≥ 3, our algorithms for hypergraphs of rank k, where the rank is the maximum size of a hyperedge, outperform the previous best. This also implies improved upper bounds on the maximum number of minimal transversals in n-vertex hypergraphs of rank k ≥ 3. Our main algorithm is a branching algorithm whose running time is analyzed with Measure and Conquer. It enumerates all minimal transversals of hypergraphs of rank 3 in time O(1.6755n). Our algorithm for hypergraphs of rank 4 is based on iterative compression. Our enumeration algorithms improve upon the best known algorithms for counting minimum transversals in hypergraphs of rank k for k ≥ 3 and for computing a minimum transversal in hypergraphs of rank k for k ≥ 6.
منابع مشابه
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transversals. We show that for an arbitrary hypergraph the families of multiple and partial transversals are both dual-bounded in the sense that the size of the corresponding dual hypergraph is bounded by a polynomial in the...
متن کاملGenerating Partial and Multiple Transversals of a Hypergraph
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transversals. We show that the hypergraphs of all multiple and all partial transversals are dualbounded in the sense that in both cases, the size of the dual hypergraph is bounded by a polynomial in the cardinality and the l...
متن کاملWeighted Transversals of a Hypergraph
We consider a generalization of the notion of transversal to a finite hypergraph, so called weighted transversals. Given a non-negative weight vector assigned to each hyperedge of the input hypergraph, we define a weighted transversal as a minimal vertex set which intersects a collection of hyperedges of sufficiently large total weight. We show that the hypergraph of all weighted transversals i...
متن کاملPartitioning of Loop-free Sperner Hypergraphs into Transversals
This article explores possibilities of partitioning the vertex set of a given simple loop-free Sperner hypergraph into a union of transversals. Studies are done on the possible number of transversals in such partitions, followed by forming a hypergraph (on the vertex set of the given hypergraph) that consists of transversals for hyperedges. AMS Subject Classification: 05C65
متن کاملA Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Finding hypergraph transversals is a major algorithmic issue which was shown having many connections with the data mining area. In this paper, by defining a new Galois connection, we show that this problem is closely related to the mining of the so-called condensed representations of frequent patterns. This data mining formalization enables us to benefit from efficient algorithms dedicated to t...
متن کامل